Models and Methods for Two-Echelon Location Routing Problem with Time Constraints in City Logistics

Models and Methods for the City Logistics: The Two-Echelon Capacitated Vehicle Routing Problem

Location-Routing Problem with Fuzzy Time Windows and Traffic Time

The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints

The location-routing problem is one of the most important location problems for designing integrated logistics systems. In the last three decades, various types of objective function and constraints have been considered for this problem. However, time window constraints have received little attention, despite their numerous real-life applications. In this article, a new 4-index mathematical mod...

Tabu Search Heuristic for a Two- Echelon Location-Routing Problem

In this paper we tackle a two-echelon location-routing problem (2E-LRP) by a tabu search metaheuristic. The aim is to define the location and number of two kinds of capacitated facilities, the size of two different vehicle fleets and the related routes on each echelon. The proposed Tabu Search (TS) for the 2E-LRP is based on the decomposition of the problem in two location-routing sub-problems,...